Search results for "geometric modelling"

showing 3 items of 3 documents

Computing Subdivision Surface Intersection

2003

Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.

průnik křivekgeometric modellinggeometrické modelovánírežim smyčky[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]intersection curvesčlenění povrchu[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]loop shemesubdivison surfacesComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Extension des méthodes de géométrie algorithmique aux structures fractales

2013

Defining shapes by iteration allows us to generate new structures with specific properties (roughness,lacunarity), which cannot be achieved with classic modelling.For developing an iterative modeller to design fractals described by a BCIFS, we developed a set oftools and algorithms that permits one to evaluate, to characterize and to analyse different geometricproperties (localisation, convex hull, volume, fractal dimension) of fractals. We identified properties ofstandard CAD operations (intersection, union, offset, . . . ) allowing us to approximate them for fractalsand also to optimize these approximation algorithms.In some cases, it is possible to construct a CIFS with generalised HUTCH…

[SPI.OTHER]Engineering Sciences [physics]/OtherConception assistée par ordinateur[ SPI.OTHER ] Engineering Sciences [physics]/Other[SPI.OTHER] Engineering Sciences [physics]/Other[ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM][INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Informatique graphiqueComputer-aided design[MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM]Géométrie algorithmiqueComputational geometryModélisation géométrique[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]Computer graphics[MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM][ INFO.INFO-OH ] Computer Science [cs]/Other [cs.OH]FractalGeometric modelling
researchProduct

From Dupin cyclides to scaled cyclides

2003

Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. They have a low algebraic degree and have been proposed as a solution to a variety of geometric modeling problems. The circular curvature line’s property facilitates the construction of the cyclide (or the portion of a cyclide) that blends two circular quadric primitives. In this context of blending, the only drawback of cyclides is that they are not suitable for the blending of elliptic quadric primitives. This problem requires the use of non circular curvature blending surfaces. In this paper, we present another formulation of cyclides: Scaled cyclides. A scaled cy…

geometric modellinggeometrické modelovánísupercyklidyDupin cyclidesBézier surfacesMathematics::Differential GeometryDupinovy cyklidyBéziérovy plochysupercyclides
researchProduct